منابع مشابه
Algorithms in Local Algebra
Let k be a eld, S = k[xv : v 2 V ] be the polynomial ring over the nite set of variables (xv : v 2 V), and m = (x v : v 2 V) the ideal dening the origin of Spec S. It is theoretically known (see e.g. Alonso et al. 1991) that the algorithmic ideas for the computation of ideal (and module) intersections, quotients, deciding radical membership etc. in S may be adopted not only for computations in ...
متن کاملAlgorithms in Local Algebra
Let k be a field, S = k[xv : v ∈ V ] be the polynomial ring over the finite set of variables (xv : v ∈ V ), and m = (xv : v ∈ V ) the ideal defining the origin of Spec S. It is theoretically known (see e.g. Alonso et al. 1991) that the algorithmic ideas for the computation of ideal (and module) intersections, quotients, deciding radical membership etc. in S may be adopted not only for computati...
متن کاملLocal Algebra in Algebraic Geometry
Introduction 1 0.1. Associated primes 2 0.2. Depth 2 1. Regular local rings and their cohomological properties 4 1.1. Notions of dimension 4 1.2. Dualizing functor 5 1.3. Local rings 6 1.4. Serre’s theorem on regular local rings 6 1.5. Cohomology of D when global dimension is finite 8 2. Depth 8 2.1. Property (Sk) 8 2.2. Serre’s criterion of normality 10 2.3. Cohen-Macaulay modules 11 3. Diviso...
متن کاملParallel algorithms in linear algebra
This paper provides an introduction to algorithms for fundamental linear algebra problems on various parallel computer architectures, with the emphasis on distributed-memory MIMD machines. To illustrate the basic concepts and key issues, we consider the problem of parallel solution of a nonsingular linear system by Gaussian elimination with partial pivoting. This problem has come to be regarded...
متن کاملLocal Basic Linear Algebra
We describe a subset of the level{1, level{2, and level{3 BLAS implemented for each node of the Connection Machine system CM{200. The routines, collectively called LBLAS, have interfaces consistent with languages with an array syntax such as Fortran 90. One novel feature, important for distributed memory architectures, is the capability of performing computations on multiple instances of object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1031